Parallel Hermite Interpolation on Faulty K-ary n-cubes Network
نویسنده
چکیده
In this paper a parallel algorithm is developed for Hermite Interpolation k-ary n-cube network. The algorithm involves three phases: initial phase; main phase and final phase. The computational statistics for the parallel algorithm are also discussed. For N = k points Hermite Interpolation the parallel algorithm in worst case involves N/2 data communications, 2N+6 multiplications , 2N+3 subtractions , N+1 addition and N divisions.
منابع مشابه
Embedding long cycles in faulty k-ary 2-cubes
The class of k-ary n-cubes represents the most commonly used interconnection topology for distributed-memory parallel systems. Given an even k P 4, let (V1,V2) be the bipartition of the k-ary 2-cube, fv1, fv2 be the numbers of faulty vertices in V1 and V2, respectively, and fe be the number of faulty edges. In this paper, we prove that there exists a cycle of length k 2max{fv1, fv2} in the k-ar...
متن کاملHamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...
متن کاملEmbeddings of hamiltonian paths in faulty k-ary 2-cubes
It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y ) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y , there exists a hamiltonian path from u to v in the faulty k-ar...
متن کاملOn the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes
We equate a routing algorithm in a (faulty) interconnection network whose underlying graph is a k-ary n-cube or a hypercube, that attempts to route a packet from a fixed source node to a fixed destination node, with the sub-digraph of (healthy) links potentially usable by this routing algorithm as it attempts to route the packet. This gives rise to a naturally defined problem, parameterized by ...
متن کاملParallel Hermite Interpolation on Extended Fibonacci Cubes
This work suggests a parallel algorithm for Hermite interpolation on Extended Fibonacci Cube (n) EFC1 . The proposed algorithm has 3 phases: initialization, main and final. The main phase of the algorithm involves 3 2 N multiplications, N additions, N 2 subtractions and N divisions. In final phase we propose an efficient algorithm to accumulate the partial sums of Hermite interpolation in 2 )...
متن کامل